Quantum Complexities and Interactive Proof Systems
نویسنده
چکیده
In complexity studies, Interactive Proof Systems are a very helpful means to establish relationships between major complexity classes. The rise of new complexity classes, which follow the properties of quantum computation, suggests a new set of variants of these systems. This paper focuses on the currently established theories in quantum complexity studies, and studies how quantum complexity classes relate to some variants of Interactive Proof Systems. Outline. In this paper, we will first overview the history and fundamentals of quantum complexity studies and interactive proof systems. Then, we will go on a journey from classical complexity classes to quantum ones, to introducing interactive proof systems and their relationships with quantum complexity classes. Lastly, we will study the relationships between the complexity classes studied so far.
منابع مشابه
On the Power of Quantum Multi-Prover Interactive Proof Systems
In this paper we introduce a quantum analogue of multi-prover interactive proof systems by naturally extending the model of single-prover quantum interactive proof systems defined by Watrous. It is proved that the class of languages having quantum multi-prover interactive proof systems is equal to NEXP. It implies that the quantum analogue has no gain to the classical counterpart in the setting...
متن کاملAn Application of Quantum Finite Automata to Interactive Proof Systems
Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell. Our quantum interactive proof...
متن کاملPSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange quantum messages. It is proved that every language in PSPACE has a quantum interactive proof system that requires a total of only three messages to be sent between the prover and verifier and has exponentially small (one...
متن کاملPSPACE has 2-round quantum interactive proof systems
In this paper we consider quantum interactive proof systems, i.e., interactive proof systems in which the prover and verifier may perform quantum computations and exchange quantum messages. It is proved that every language in PSPACE has a quantum interactive proof system that requires only two rounds of communication between the prover and verifier, while having exponentially small (one-sided) ...
متن کاملQuantum Multi-Prover Interactive Proof Systems and Quantum Characterizations of NEXP
This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. In quantum multi-prover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among provers. This paper focuses on the latter situation and proves that, if provers do not share any prio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006